On Distributed Resource Handling: Dining, Drinking and Mobile Philosophers
نویسندگان
چکیده
Resource allocation is an essential class of problems, which includes many fundamental concurrency control problems. A signi cant amount of research has been devoted to the group of these problems, which share a common part in their name: philosophers (dining, drinking, mobile,...) We survey some of the main developments in this eld.
منابع مشابه
The Drinking Philosophers Problem: Resource Allocation in Distributed Systems Seminar paper on Distributed Programming
In 1971 E. W. Dijkstra published the dining philosophers problem, which, since then, has become representative for resource allocation problems in concurrent and distributed programming. In this seminar paper, a generalization called the drinking philosophers problem by Chandy and Misra is surveyed. Since the problems has practical relevance, it has drawn a lot of attention and many different s...
متن کاملScheduling Jobs Using Common Resources
This paper examines the problem of distributed resource allocation in different models of computation and communication in distributed systems, and presents a number of time optimal (randomized and deterministic) allocation algorithms. We consider the dining drinking philosophers problem as presented in [B. Awerbuch and M. Saks, in ``FOCS,'' pp. 65 74. IEEE, New York, 1990]. In the algorithm pr...
متن کاملA New Distributed Resource-Allocation Algorithm with Optimal Failure Locality
Failure locality measures an algorithm’s robustness to process failures. We present a new algorithm for the dining philosophers problem — a classic problem in distributed resource allocation — that has optimal failure locality. As a refinement, the algorithm can be easily parameterized by a simple failure model to achieve super-optimal failure locality in the average case.
متن کاملAlgorithms for Dynamic Channel Assignment
The eeciency of channel assignment in a cellular telephone system is considered using the measures of successful channel assignment ratio as well as response time. Existing paradigms of mutual exclusion and dining philosophers from distributed systems are used to synthesize new algorithms that optimize both measures. The results are veriied by extensive simulations.
متن کاملResource Allocation on Dynamic Con ict Graphs
The sharing of resources among processes in a distributed system leads to a connict graph that may change with time. Resource allocation over a static connict graph (also called the dining philosophers problem) has been studied extensively. We seek to solve resource allocation on dynamic connict graphs by using existing algorithms that work only for static connict graphs. In the process we deen...
متن کامل